Are Minds Computable?
نویسنده
چکیده
This essay explores the limits of Turing machines concerning the modeling of minds and suggests alternatives to go beyond those limits.
منابع مشابه
Semiotic Systems
In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also ar...
متن کاملYou Don't Need a Hypercomputer to Evaluate an Uncomputable Function
I believe the human mind can evaluate functions so uncomputable that no machine, not even a hypercomputer, can compute them. But I believe that computers can evaluate such functions too, because computers, like minds, have other ways to evaluate functions that go beyond computing. If we allow them to use these ways – or, as I shall put it, to uncompute – they may be able to do things that only ...
متن کاملHow minds can be computational systems
The proper treatment of computationalism, as the thesis that cognition is computable, is presented and defended. Some arguments of James H. Fetzer against computationalism are examined and found wanting, and his positive theory of minds as semiotic systems is shown to be consistent with computationalism. An objection is raised to an argument of Selmer Bringsjord against one strand of computatio...
متن کاملSyntactic Semantics and the Proper Treatment of Computationalism
Computationalism should not be the view that (human) cognition is computation; it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. If semiotic systems are systems that interpret signs, then both humans and computers are semiotic systems. Finally, minds can be cons...
متن کاملDoes Resolving PvNP Require a Paradigm Shift? Part I: A Perspective
I shall argue that a resolution of the PvNP problem requires building an iff bridge between the domain of provability and that of computability. The former concerns how human minds decide the truth of number-theoretic relations, and is formalised by first-order Peano Arithmetic following Dededekind’s axiomatisation of Peano’s Postulates. The latter concerns how human minds compute the values of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1110.3002 شماره
صفحات -
تاریخ انتشار 2011